Variable-rate hierarchical vector quantization with variance classification
نویسندگان
چکیده
Because the bit rate can be adjusted depending on the network traffic situation, the variable bit rate is more suitable than a fixed rate for transmitting images on the network. In this paper, a new variable rate hierarchical classified vector quantization (VHCVQ) scheme is proposed. This technique is suitable for progressive transmission. In our two-stage VHCVQ scheme, we use the differences between the first-stage input vectors and the first-stage quantized vectors, called residual vectors, to code the image in the second stage. Usually the values between these differences are small and each is close to one another. Using the difference to code the image may reduce the codebook size and the bit rate as well. In our simulation, using these differences reduced the bit rate by about 0.075 bpp. © 2000 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 11, 138–143,
منابع مشابه
Efficient Coding of the Classification Table in Low Bit Rate Subband Image Coding by Use of Hierarchical Enumeration
A new method for lossless coding of the classiication table in low bit rate subband image coders with block-wise classiication is proposed. The method is referred to as hierarchical enumeration and uses an algorithmic enumeration technique to associate a xed-length unique binary code-word with each possible combination of integers deening the classiication table. The resulting bit rate is less ...
متن کاملHigh Speed and High Accuracy Rough Classification for Handwritten Characters Using Hierarchical Learning Vector Quantization∗
We propose a rough classification system using Hierarchical Learning Vector Quantization (HLVQ) for large scale classification problems which involve many categories. HLVQ of proposed system divides categories hierarchically in the feature space, makes a tree and multiplies the nodes down the hierarchy. The feature space is divided by a few codebook vectors in each layer. The adjacent feature s...
متن کاملOptimal pruning with applications to tree-structured source coding and modeling
An algorithm recently introduced by Breiman, Friedman, Olshen, and Stone in the context of classification and regression trees is reinterpreted and extended to cover a variety of applications in source coding and modeling in which trees are involved. These include variable-rate and minimum-entropy tree-structured vector quantization, minimum expected cost decision trees, variable-order Markov m...
متن کاملVariable Dimension Vector Quantization of Speech Spectra for Low Rate Vocoders
Optimal vector quantization of variable-dimension vectors in principle is feasible by using a set of fixed dimension VQ codebooks. However, for typical applications, such a multi-codebook approach demands a grossly excessive and impractical storage and computational complexity. Efficient quantization of such variable-dimension spectral shape vectors is the most challenging and difficult encodin...
متن کاملPredictive hierarchical table-lookup vector quantization with quadtree encoding
In this paper we present an algorithm for image compression which involves adaptively segmenting a block of residuals resulting from pirediction, while encoding them using hierarchical table lookup vector quantization. An optimum decomposition of the block allows an image to be adaptively quantized depending on the statistics of the residual block being encoded. This is useful since most images...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Imaging Systems and Technology
دوره 11 شماره
صفحات -
تاریخ انتشار 2000